<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html lang="en">
<head>
<title>Source code</title>
<link rel="stylesheet" type="text/css" href="../../../../../stylesheet.css" title="Style">
</head>
<body>
<div class="sourceContainer">
<pre><span class="sourceLineNo">001</span>package com.palamida.util.collect;<a name="line.1"></a>
<span class="sourceLineNo">002</span><a name="line.2"></a>
<span class="sourceLineNo">003</span>import static com.google.common.base.Preconditions.checkArgument;<a name="line.3"></a>
<span class="sourceLineNo">004</span>import static com.google.common.base.Preconditions.checkNotNull;<a name="line.4"></a>
<span class="sourceLineNo">005</span>import static com.google.common.base.Preconditions.checkState;<a name="line.5"></a>
<span class="sourceLineNo">006</span><a name="line.6"></a>
<span class="sourceLineNo">007</span>import java.io.Serializable;<a name="line.7"></a>
<span class="sourceLineNo">008</span>import java.util.Collection;<a name="line.8"></a>
<span class="sourceLineNo">009</span>import java.util.Comparator;<a name="line.9"></a>
<span class="sourceLineNo">010</span>import java.util.PriorityQueue;<a name="line.10"></a>
<span class="sourceLineNo">011</span>import java.util.Queue;<a name="line.11"></a>
<span class="sourceLineNo">012</span>import java.util.SortedSet;<a name="line.12"></a>
<span class="sourceLineNo">013</span><a name="line.13"></a>
<span class="sourceLineNo">014</span>import com.google.common.collect.ForwardingQueue;<a name="line.14"></a>
<span class="sourceLineNo">015</span>import com.google.common.collect.Iterables;<a name="line.15"></a>
<span class="sourceLineNo">016</span>import com.google.common.collect.MinMaxPriorityQueue;<a name="line.16"></a>
<span class="sourceLineNo">017</span>import com.google.common.collect.Ordering;<a name="line.17"></a>
<span class="sourceLineNo">018</span><a name="line.18"></a>
<span class="sourceLineNo">019</span>/**<a name="line.19"></a>
<span class="sourceLineNo">020</span> * An implementation of {@link BoundedQueue} backed by a {@link TreeQueue}. The<a name="line.20"></a>
<span class="sourceLineNo">021</span> * elements of this queue are sorted according to their &lt;i&gt;natural ordering&lt;/i&gt;,<a name="line.21"></a>
<span class="sourceLineNo">022</span> * or by an explicit {@link Comparator} provided at creation. Inserting<a name="line.22"></a>
<span class="sourceLineNo">023</span> * {@code null} elements is prohibited. Attempting to insert non-comparable<a name="line.23"></a>
<span class="sourceLineNo">024</span> * elements will result in a {@code ClassCastException}.<a name="line.24"></a>
<span class="sourceLineNo">025</span> * &lt;p&gt;<a name="line.25"></a>
<span class="sourceLineNo">026</span> * The first element (the head) of this queue is considered to be the<a name="line.26"></a>
<span class="sourceLineNo">027</span> * &lt;i&gt;least&lt;/i&gt; element with respect to the specified ordering. Elements with<a name="line.27"></a>
<span class="sourceLineNo">028</span> * equal priority are ordered according to their insertion order.<a name="line.28"></a>
<span class="sourceLineNo">029</span> * &lt;p&gt;<a name="line.29"></a>
<span class="sourceLineNo">030</span> * When the queue is full the {@code offer(E)} method behaves according to the<a name="line.30"></a>
<span class="sourceLineNo">031</span> * following policy: if the element to be added has higher priority than the<a name="line.31"></a>
<span class="sourceLineNo">032</span> * lowest priority element currently in the queue, the new element is added and<a name="line.32"></a>
<span class="sourceLineNo">033</span> * the lowest priority element is removed; else the new element is rejected. The<a name="line.33"></a>
<span class="sourceLineNo">034</span> * backing {@code TreeQueue} maintains references to the highest and lowest<a name="line.34"></a>
<span class="sourceLineNo">035</span> * elements in the queue; rejecting an element is an &lt;i&gt;O(1)&lt;/i&gt; operation.<a name="line.35"></a>
<span class="sourceLineNo">036</span> * &lt;p&gt;<a name="line.36"></a>
<span class="sourceLineNo">037</span> * The {@code add(E)} and {@code addAll(Collection)} operations will throw an<a name="line.37"></a>
<span class="sourceLineNo">038</span> * {@code IllegalStateException} when the queue is full and a new element is<a name="line.38"></a>
<span class="sourceLineNo">039</span> * rejected; as required by the contract of {@link Queue#add Queue.add(E)}.<a name="line.39"></a>
<span class="sourceLineNo">040</span> * &lt;p&gt;<a name="line.40"></a>
<span class="sourceLineNo">041</span> * Bounded priority queues are useful when implementing &lt;i&gt;n-best&lt;/i&gt; algorithms<a name="line.41"></a>
<span class="sourceLineNo">042</span> * (e.g. finding the &lt;i&gt;best&lt;/i&gt; &lt;i&gt;n&lt;/i&gt; elements in an arbitrary collection).<a name="line.42"></a>
<span class="sourceLineNo">043</span> * &lt;p&gt;<a name="line.43"></a>
<span class="sourceLineNo">044</span> * This queue is not &lt;i&gt;thread-safe&lt;/i&gt;. If multiple threads modify this queue<a name="line.44"></a>
<span class="sourceLineNo">045</span> * concurrently it must be synchronized externally.<a name="line.45"></a>
<span class="sourceLineNo">046</span> * &lt;p&gt;<a name="line.46"></a>
<span class="sourceLineNo">047</span> * Refer to {@link TreeQueue} for details of the underlying implementation.<a name="line.47"></a>
<span class="sourceLineNo">048</span> * <a name="line.48"></a>
<span class="sourceLineNo">049</span> * @author Zhenya Leonov<a name="line.49"></a>
<span class="sourceLineNo">050</span> * @param &lt;E&gt;<a name="line.50"></a>
<span class="sourceLineNo">051</span> *            the type of elements held in this queue<a name="line.51"></a>
<span class="sourceLineNo">052</span> */<a name="line.52"></a>
<span class="sourceLineNo">053</span>final public class TreeBoundedQueue&lt;E&gt; extends ForwardingQueue&lt;E&gt; implements<a name="line.53"></a>
<span class="sourceLineNo">054</span>                BoundedQueue&lt;E&gt;, SortedCollection&lt;E&gt;, Serializable, Cloneable {<a name="line.54"></a>
<span class="sourceLineNo">055</span><a name="line.55"></a>
<span class="sourceLineNo">056</span>        private static final long serialVersionUID = 1L;<a name="line.56"></a>
<span class="sourceLineNo">057</span>        private TreeQueue&lt;E&gt; delegate;<a name="line.57"></a>
<span class="sourceLineNo">058</span>        private final int maxSize;<a name="line.58"></a>
<span class="sourceLineNo">059</span><a name="line.59"></a>
<span class="sourceLineNo">060</span>        private TreeBoundedQueue(final int capacity,<a name="line.60"></a>
<span class="sourceLineNo">061</span>                        final Comparator&lt;? super E&gt; comparator) {<a name="line.61"></a>
<span class="sourceLineNo">062</span>                delegate = TreeQueue.orderedBy(comparator).create();<a name="line.62"></a>
<span class="sourceLineNo">063</span>                this.maxSize = capacity;<a name="line.63"></a>
<span class="sourceLineNo">064</span>        }<a name="line.64"></a>
<span class="sourceLineNo">065</span><a name="line.65"></a>
<span class="sourceLineNo">066</span>        private TreeBoundedQueue(final Comparator&lt;? super E&gt; comparator,<a name="line.66"></a>
<span class="sourceLineNo">067</span>                        final Iterable&lt;? extends E&gt; elements) {<a name="line.67"></a>
<span class="sourceLineNo">068</span>                delegate = TreeQueue.orderedBy(comparator).create();<a name="line.68"></a>
<span class="sourceLineNo">069</span>                for (E e : elements)<a name="line.69"></a>
<span class="sourceLineNo">070</span>                        offer(e);<a name="line.70"></a>
<span class="sourceLineNo">071</span>                checkArgument(size() &gt; 0);<a name="line.71"></a>
<span class="sourceLineNo">072</span>                this.maxSize = size();<a name="line.72"></a>
<span class="sourceLineNo">073</span>        }<a name="line.73"></a>
<span class="sourceLineNo">074</span><a name="line.74"></a>
<span class="sourceLineNo">075</span>        // /**<a name="line.75"></a>
<span class="sourceLineNo">076</span>        // * Creates a new {@code TreeBoundedQeque} which orders its elements<a name="line.76"></a>
<span class="sourceLineNo">077</span>        // * according to their &lt;i&gt;natural ordering&lt;/i&gt;, and having the specified<a name="line.77"></a>
<span class="sourceLineNo">078</span>        // * maximum size.<a name="line.78"></a>
<span class="sourceLineNo">079</span>        // *<a name="line.79"></a>
<span class="sourceLineNo">080</span>        // * @param maximumSize<a name="line.80"></a>
<span class="sourceLineNo">081</span>        // * the maximum size (the bound) of this queue<a name="line.81"></a>
<span class="sourceLineNo">082</span>        // * @return returns a new {@code TreeBoundedQeque} which orders its<a name="line.82"></a>
<span class="sourceLineNo">083</span>        // elements<a name="line.83"></a>
<span class="sourceLineNo">084</span>        // * according to their &lt;i&gt;natural ordering&lt;/i&gt;, having the specified<a name="line.84"></a>
<span class="sourceLineNo">085</span>        // * maximum size<a name="line.85"></a>
<span class="sourceLineNo">086</span>        // * @throws IllegalArgumentException<a name="line.86"></a>
<span class="sourceLineNo">087</span>        // * if {@code maximumSize} is less than 1<a name="line.87"></a>
<span class="sourceLineNo">088</span>        // */<a name="line.88"></a>
<span class="sourceLineNo">089</span>        // public static &lt;E extends Comparable&lt;? super E&gt;&gt; TreeBoundedQueue&lt;E&gt;<a name="line.89"></a>
<span class="sourceLineNo">090</span>        // create(<a name="line.90"></a>
<span class="sourceLineNo">091</span>        // final int maximumSize) {<a name="line.91"></a>
<span class="sourceLineNo">092</span>        // checkArgument(maximumSize &gt; 0);<a name="line.92"></a>
<span class="sourceLineNo">093</span>        // return new TreeBoundedQueue&lt;E&gt;(maximumSize, Ordering.natural());<a name="line.93"></a>
<span class="sourceLineNo">094</span>        // }<a name="line.94"></a>
<span class="sourceLineNo">095</span><a name="line.95"></a>
<span class="sourceLineNo">096</span>        // /**<a name="line.96"></a>
<span class="sourceLineNo">097</span>        // * Creates a new empty {@code TreeBoundedQeque} having the specified<a name="line.97"></a>
<span class="sourceLineNo">098</span>        // maximum<a name="line.98"></a>
<span class="sourceLineNo">099</span>        // * size and comparator.<a name="line.99"></a>
<span class="sourceLineNo">100</span>        // *<a name="line.100"></a>
<span class="sourceLineNo">101</span>        // * @param maximumSize<a name="line.101"></a>
<span class="sourceLineNo">102</span>        // * the maximum size (the bound) of this queue<a name="line.102"></a>
<span class="sourceLineNo">103</span>        // * @param comparator<a name="line.103"></a>
<span class="sourceLineNo">104</span>        // * the comparator that will be used to order this queue<a name="line.104"></a>
<span class="sourceLineNo">105</span>        // * @return returns a new {@code TreeBoundedQeque} having the specified<a name="line.105"></a>
<span class="sourceLineNo">106</span>        // * maximum size<a name="line.106"></a>
<span class="sourceLineNo">107</span>        // * @throws IllegalArgumentException<a name="line.107"></a>
<span class="sourceLineNo">108</span>        // * if {@code maximumSize} is less than 1<a name="line.108"></a>
<span class="sourceLineNo">109</span>        // */<a name="line.109"></a>
<span class="sourceLineNo">110</span>        // public static &lt;E&gt; TreeBoundedQueue&lt;E&gt; create(final int maximumSize,<a name="line.110"></a>
<span class="sourceLineNo">111</span>        // final Comparator&lt;? super E&gt; comparator) {<a name="line.111"></a>
<span class="sourceLineNo">112</span>        // checkArgument(maximumSize &gt; 0);<a name="line.112"></a>
<span class="sourceLineNo">113</span>        // checkNotNull(comparator);<a name="line.113"></a>
<span class="sourceLineNo">114</span>        // return new TreeBoundedQueue&lt;E&gt;(maximumSize, comparator);<a name="line.114"></a>
<span class="sourceLineNo">115</span>        // }<a name="line.115"></a>
<span class="sourceLineNo">116</span><a name="line.116"></a>
<span class="sourceLineNo">117</span>        /**<a name="line.117"></a>
<span class="sourceLineNo">118</span>         * Creates a new {@code TreeBoundedQueue} containing the elements of, and<a name="line.118"></a>
<span class="sourceLineNo">119</span>         * having its capacity equal to the number of elements in the specified<a name="line.119"></a>
<span class="sourceLineNo">120</span>         * collection. If the collection is an instance of {@link SortedSet},<a name="line.120"></a>
<span class="sourceLineNo">121</span>         * {@link PriorityQueue}, {@link MinMaxPriorityQueue}, or<a name="line.121"></a>
<span class="sourceLineNo">122</span>         * {@code SortedCollection} this queue will be ordered according to the same<a name="line.122"></a>
<span class="sourceLineNo">123</span>         * ordering. Otherwise, this queue will be ordered according to the<a name="line.123"></a>
<span class="sourceLineNo">124</span>         * &lt;i&gt;natural ordering&lt;/i&gt; of its elements.<a name="line.124"></a>
<span class="sourceLineNo">125</span>         * <a name="line.125"></a>
<span class="sourceLineNo">126</span>         * @param elements<a name="line.126"></a>
<span class="sourceLineNo">127</span>         *            the collection whose elements are to be placed into the queue<a name="line.127"></a>
<span class="sourceLineNo">128</span>         * @return a new {@code TreeBoundedQueue} containing the elements of the<a name="line.128"></a>
<span class="sourceLineNo">129</span>         *         specified collection<a name="line.129"></a>
<span class="sourceLineNo">130</span>         * @throws ClassCastException<a name="line.130"></a>
<span class="sourceLineNo">131</span>         *             if elements of the specified collection cannot be compared to<a name="line.131"></a>
<span class="sourceLineNo">132</span>         *             one another according to the priority queue's ordering<a name="line.132"></a>
<span class="sourceLineNo">133</span>         * @throws NullPointerException<a name="line.133"></a>
<span class="sourceLineNo">134</span>         *             if any of the elements of the specified collection or the<a name="line.134"></a>
<span class="sourceLineNo">135</span>         *             collection itself is {@code null}<a name="line.135"></a>
<span class="sourceLineNo">136</span>         * @throws IllegalArgumentException<a name="line.136"></a>
<span class="sourceLineNo">137</span>         *             if the specified collection is empty<a name="line.137"></a>
<span class="sourceLineNo">138</span>         */<a name="line.138"></a>
<span class="sourceLineNo">139</span>        @SuppressWarnings({ "unchecked" })<a name="line.139"></a>
<span class="sourceLineNo">140</span>        public static &lt;E&gt; TreeBoundedQueue&lt;E&gt; from(<a name="line.140"></a>
<span class="sourceLineNo">141</span>                        final Collection&lt;? extends E&gt; elements) {<a name="line.141"></a>
<span class="sourceLineNo">142</span>                checkNotNull(elements);<a name="line.142"></a>
<span class="sourceLineNo">143</span>                final Comparator&lt;? super E&gt; comparator;<a name="line.143"></a>
<span class="sourceLineNo">144</span>                if (elements instanceof SortedSet&lt;?&gt;)<a name="line.144"></a>
<span class="sourceLineNo">145</span>                        comparator = ((SortedSet&lt;? super E&gt;) elements).comparator();<a name="line.145"></a>
<span class="sourceLineNo">146</span>                else if (elements instanceof PriorityQueue&lt;?&gt;)<a name="line.146"></a>
<span class="sourceLineNo">147</span>                        comparator = ((PriorityQueue&lt;? super E&gt;) elements).comparator();<a name="line.147"></a>
<span class="sourceLineNo">148</span>                else if (elements instanceof SortedCollection&lt;?&gt;)<a name="line.148"></a>
<span class="sourceLineNo">149</span>                        comparator = ((SortedCollection&lt;? super E&gt;) elements).comparator();<a name="line.149"></a>
<span class="sourceLineNo">150</span>                else if (elements instanceof MinMaxPriorityQueue&lt;?&gt;)<a name="line.150"></a>
<span class="sourceLineNo">151</span>                        comparator = ((MinMaxPriorityQueue&lt;? super E&gt;) elements)<a name="line.151"></a>
<span class="sourceLineNo">152</span>                                        .comparator();<a name="line.152"></a>
<span class="sourceLineNo">153</span>                else<a name="line.153"></a>
<span class="sourceLineNo">154</span>                        comparator = (Comparator&lt;? super E&gt;) Ordering.natural();<a name="line.154"></a>
<span class="sourceLineNo">155</span>                return new TreeBoundedQueue&lt;E&gt;(comparator, elements);<a name="line.155"></a>
<span class="sourceLineNo">156</span>        }<a name="line.156"></a>
<span class="sourceLineNo">157</span><a name="line.157"></a>
<span class="sourceLineNo">158</span>        /**<a name="line.158"></a>
<span class="sourceLineNo">159</span>         * Returns a new builder configured to build {@code TreeBoundedQueue}<a name="line.159"></a>
<span class="sourceLineNo">160</span>         * instances with the specified capacity.<a name="line.160"></a>
<span class="sourceLineNo">161</span>         * <a name="line.161"></a>
<span class="sourceLineNo">162</span>         * @param capacity<a name="line.162"></a>
<span class="sourceLineNo">163</span>         *            the total number of elements which can be placed in this queue<a name="line.163"></a>
<span class="sourceLineNo">164</span>         * @return a new builder configured to build {@code TreeBoundedQueue}<a name="line.164"></a>
<span class="sourceLineNo">165</span>         *         instances that use the specified comparator for ordering<a name="line.165"></a>
<span class="sourceLineNo">166</span>         */<a name="line.166"></a>
<span class="sourceLineNo">167</span>        public static &lt;E extends Comparable&lt;? super E&gt;&gt; Builder&lt;E&gt; withMaxSize(<a name="line.167"></a>
<span class="sourceLineNo">168</span>                        final int capacity) {<a name="line.168"></a>
<span class="sourceLineNo">169</span>                checkState(capacity &gt; 0, "Capacity &lt; 1");<a name="line.169"></a>
<span class="sourceLineNo">170</span>                final Comparator&lt;E&gt; c = Ordering.natural();<a name="line.170"></a>
<span class="sourceLineNo">171</span>                return new Builder&lt;E&gt;(c).capacity(capacity);<a name="line.171"></a>
<span class="sourceLineNo">172</span>        }<a name="line.172"></a>
<span class="sourceLineNo">173</span><a name="line.173"></a>
<span class="sourceLineNo">174</span>        /**<a name="line.174"></a>
<span class="sourceLineNo">175</span>         * Returns a new builder configured to build {@code TreeBoundedQueue}<a name="line.175"></a>
<span class="sourceLineNo">176</span>         * instances that use the specified comparator for ordering.<a name="line.176"></a>
<span class="sourceLineNo">177</span>         * <a name="line.177"></a>
<span class="sourceLineNo">178</span>         * @param comparator<a name="line.178"></a>
<span class="sourceLineNo">179</span>         *            the specified comparator<a name="line.179"></a>
<span class="sourceLineNo">180</span>         * @return a new builder configured to build {@code TreeBoundedQueue}<a name="line.180"></a>
<span class="sourceLineNo">181</span>         *         instances that use the specified comparator for ordering<a name="line.181"></a>
<span class="sourceLineNo">182</span>         */<a name="line.182"></a>
<span class="sourceLineNo">183</span>        public static &lt;B&gt; Builder&lt;B&gt; orderedBy(final Comparator&lt;B&gt; comparator) {<a name="line.183"></a>
<span class="sourceLineNo">184</span>                checkNotNull(comparator);<a name="line.184"></a>
<span class="sourceLineNo">185</span>                return new Builder&lt;B&gt;(comparator);<a name="line.185"></a>
<span class="sourceLineNo">186</span>        }<a name="line.186"></a>
<span class="sourceLineNo">187</span><a name="line.187"></a>
<span class="sourceLineNo">188</span>        /**<a name="line.188"></a>
<span class="sourceLineNo">189</span>         * A builder for the creation of {@code TreeBoundedQueue} instances.<a name="line.189"></a>
<span class="sourceLineNo">190</span>         * Instances of this builder are obtained calling<a name="line.190"></a>
<span class="sourceLineNo">191</span>         * {@link TreeBoundedQueue#orderedBy(Comparator)} and<a name="line.191"></a>
<span class="sourceLineNo">192</span>         * {@link TreeBoundedQueue#withMaxSize(int)}.<a name="line.192"></a>
<span class="sourceLineNo">193</span>         * <a name="line.193"></a>
<span class="sourceLineNo">194</span>         * @author Zhenya Leonov<a name="line.194"></a>
<span class="sourceLineNo">195</span>         * @param &lt;B&gt;<a name="line.195"></a>
<span class="sourceLineNo">196</span>         *            the upper bound of the type of queues this builder can produce<a name="line.196"></a>
<span class="sourceLineNo">197</span>         *            (for example a {@code Builder&lt;Number&gt;} can produce a<a name="line.197"></a>
<span class="sourceLineNo">198</span>         *            {@code TreeBoundedQueue&lt;Float&gt;} or a<a name="line.198"></a>
<span class="sourceLineNo">199</span>         *            {@code TreeBoundedQueue&lt;Integer&gt;}<a name="line.199"></a>
<span class="sourceLineNo">200</span>         */<a name="line.200"></a>
<span class="sourceLineNo">201</span>        public static final class Builder&lt;B&gt; {<a name="line.201"></a>
<span class="sourceLineNo">202</span><a name="line.202"></a>
<span class="sourceLineNo">203</span>                private final Comparator&lt;B&gt; comparator;<a name="line.203"></a>
<span class="sourceLineNo">204</span>                private int capacity = 0;<a name="line.204"></a>
<span class="sourceLineNo">205</span><a name="line.205"></a>
<span class="sourceLineNo">206</span>                private Builder(final Comparator&lt;B&gt; comparator) {<a name="line.206"></a>
<span class="sourceLineNo">207</span>                        this.comparator = comparator;<a name="line.207"></a>
<span class="sourceLineNo">208</span>                }<a name="line.208"></a>
<span class="sourceLineNo">209</span><a name="line.209"></a>
<span class="sourceLineNo">210</span>                /**<a name="line.210"></a>
<span class="sourceLineNo">211</span>                 * Configures this builder to build {@code TreeBoundedQueue} instances<a name="line.211"></a>
<span class="sourceLineNo">212</span>                 * with the specified capacity.<a name="line.212"></a>
<span class="sourceLineNo">213</span>                 * <a name="line.213"></a>
<span class="sourceLineNo">214</span>                 * @param capacity<a name="line.214"></a>
<span class="sourceLineNo">215</span>                 *            the total number of elements which can be placed in this queue<a name="line.215"></a>
<span class="sourceLineNo">216</span>                 * @return this builder<a name="line.216"></a>
<span class="sourceLineNo">217</span>                 */<a name="line.217"></a>
<span class="sourceLineNo">218</span>                public Builder&lt;B&gt; capacity(final int capacity) {<a name="line.218"></a>
<span class="sourceLineNo">219</span>                        checkState(capacity &gt; 0, "Capacity &lt; 1");<a name="line.219"></a>
<span class="sourceLineNo">220</span>                        this.capacity = capacity;<a name="line.220"></a>
<span class="sourceLineNo">221</span>                        return this;<a name="line.221"></a>
<span class="sourceLineNo">222</span>                }<a name="line.222"></a>
<span class="sourceLineNo">223</span><a name="line.223"></a>
<span class="sourceLineNo">224</span>                /**<a name="line.224"></a>
<span class="sourceLineNo">225</span>                 * Builds an empty {@code TreeBoundedQueue} using the previously<a name="line.225"></a>
<span class="sourceLineNo">226</span>                 * specified comparator and capacity.<a name="line.226"></a>
<span class="sourceLineNo">227</span>                 * <a name="line.227"></a>
<span class="sourceLineNo">228</span>                 * @return an empty {@code TreeBoundedQueue} using the previously<a name="line.228"></a>
<span class="sourceLineNo">229</span>                 *         specified comparator and capacity<a name="line.229"></a>
<span class="sourceLineNo">230</span>                 * @throws IllegalArgumentException<a name="line.230"></a>
<span class="sourceLineNo">231</span>                 *             if the capacity has not been specified<a name="line.231"></a>
<span class="sourceLineNo">232</span>                 */<a name="line.232"></a>
<span class="sourceLineNo">233</span>                public &lt;T extends B&gt; TreeBoundedQueue&lt;T&gt; create() {<a name="line.233"></a>
<span class="sourceLineNo">234</span>                        checkState(capacity &gt; 0, "Capacity unspecified");<a name="line.234"></a>
<span class="sourceLineNo">235</span>                        return new TreeBoundedQueue&lt;T&gt;(capacity, comparator);<a name="line.235"></a>
<span class="sourceLineNo">236</span>                }<a name="line.236"></a>
<span class="sourceLineNo">237</span><a name="line.237"></a>
<span class="sourceLineNo">238</span>                /**<a name="line.238"></a>
<span class="sourceLineNo">239</span>                 * Builds a new {@code TreeBoundedQueue} using the previously specified<a name="line.239"></a>
<span class="sourceLineNo">240</span>                 * comparator and capacity, having the given initial elements.<a name="line.240"></a>
<span class="sourceLineNo">241</span>                 * <a name="line.241"></a>
<span class="sourceLineNo">242</span>                 * @param elements<a name="line.242"></a>
<span class="sourceLineNo">243</span>                 *            the initial elements to be placed in this queue<a name="line.243"></a>
<span class="sourceLineNo">244</span>                 * @return a new {@code TreeBoundedQueue} using the previously specified<a name="line.244"></a>
<span class="sourceLineNo">245</span>                 *         comparator and capacity, having the given initial<a name="line.245"></a>
<span class="sourceLineNo">246</span>                 *         elements<a name="line.246"></a>
<span class="sourceLineNo">247</span>                 * @throws IllegalStateException<a name="line.247"></a>
<span class="sourceLineNo">248</span>                 *             if the capacity has not been specified<a name="line.248"></a>
<span class="sourceLineNo">249</span>                 */<a name="line.249"></a>
<span class="sourceLineNo">250</span>                public &lt;T extends B&gt; TreeBoundedQueue&lt;T&gt; create(<a name="line.250"></a>
<span class="sourceLineNo">251</span>                                final Iterable&lt;? extends T&gt; elements) {<a name="line.251"></a>
<span class="sourceLineNo">252</span>                        checkState(capacity &gt; 0, "Capacity unspecified");<a name="line.252"></a>
<span class="sourceLineNo">253</span>                        checkNotNull(elements);<a name="line.253"></a>
<span class="sourceLineNo">254</span>                        final TreeBoundedQueue&lt;T&gt; list = new TreeBoundedQueue&lt;T&gt;(<a name="line.254"></a>
<span class="sourceLineNo">255</span>                                        capacity, comparator);<a name="line.255"></a>
<span class="sourceLineNo">256</span>                        Iterables.addAll(list, elements);<a name="line.256"></a>
<span class="sourceLineNo">257</span>                        return list;<a name="line.257"></a>
<span class="sourceLineNo">258</span>                }<a name="line.258"></a>
<span class="sourceLineNo">259</span>        }<a name="line.259"></a>
<span class="sourceLineNo">260</span><a name="line.260"></a>
<span class="sourceLineNo">261</span>        @Override<a name="line.261"></a>
<span class="sourceLineNo">262</span>        public boolean add(E e) {<a name="line.262"></a>
<span class="sourceLineNo">263</span>                checkState(offer(e), "Queue full");<a name="line.263"></a>
<span class="sourceLineNo">264</span>                return true;<a name="line.264"></a>
<span class="sourceLineNo">265</span>        }<a name="line.265"></a>
<span class="sourceLineNo">266</span><a name="line.266"></a>
<span class="sourceLineNo">267</span>        @Override<a name="line.267"></a>
<span class="sourceLineNo">268</span>        public boolean offer(E e) {<a name="line.268"></a>
<span class="sourceLineNo">269</span>                if (size() == maxSize)<a name="line.269"></a>
<span class="sourceLineNo">270</span>                        if (comparator().compare(e, delegate().peekLast()) &lt; 0)<a name="line.270"></a>
<span class="sourceLineNo">271</span>                                delegate().pollLast();<a name="line.271"></a>
<span class="sourceLineNo">272</span>                        else<a name="line.272"></a>
<span class="sourceLineNo">273</span>                                return false;<a name="line.273"></a>
<span class="sourceLineNo">274</span>                return delegate().offer(e);<a name="line.274"></a>
<span class="sourceLineNo">275</span>        }<a name="line.275"></a>
<span class="sourceLineNo">276</span><a name="line.276"></a>
<span class="sourceLineNo">277</span>        @Override<a name="line.277"></a>
<span class="sourceLineNo">278</span>        public int maxSize() {<a name="line.278"></a>
<span class="sourceLineNo">279</span>                return maxSize;<a name="line.279"></a>
<span class="sourceLineNo">280</span>        }<a name="line.280"></a>
<span class="sourceLineNo">281</span><a name="line.281"></a>
<span class="sourceLineNo">282</span>        @Override<a name="line.282"></a>
<span class="sourceLineNo">283</span>        public int remainingCapacity() {<a name="line.283"></a>
<span class="sourceLineNo">284</span>                return maxSize - size();<a name="line.284"></a>
<span class="sourceLineNo">285</span>        }<a name="line.285"></a>
<span class="sourceLineNo">286</span>        <a name="line.286"></a>
<span class="sourceLineNo">287</span>        @Override<a name="line.287"></a>
<span class="sourceLineNo">288</span>        public boolean isFull() {<a name="line.288"></a>
<span class="sourceLineNo">289</span>                return maxSize == size();<a name="line.289"></a>
<span class="sourceLineNo">290</span>        }<a name="line.290"></a>
<span class="sourceLineNo">291</span><a name="line.291"></a>
<span class="sourceLineNo">292</span>        @Override<a name="line.292"></a>
<span class="sourceLineNo">293</span>        public Comparator&lt;? super E&gt; comparator() {<a name="line.293"></a>
<span class="sourceLineNo">294</span>                return delegate().comparator();<a name="line.294"></a>
<span class="sourceLineNo">295</span>        }<a name="line.295"></a>
<span class="sourceLineNo">296</span><a name="line.296"></a>
<span class="sourceLineNo">297</span>        @Override<a name="line.297"></a>
<span class="sourceLineNo">298</span>        protected TreeQueue&lt;E&gt; delegate() {<a name="line.298"></a>
<span class="sourceLineNo">299</span>                return delegate;<a name="line.299"></a>
<span class="sourceLineNo">300</span>        }<a name="line.300"></a>
<span class="sourceLineNo">301</span><a name="line.301"></a>
<span class="sourceLineNo">302</span>        /**<a name="line.302"></a>
<span class="sourceLineNo">303</span>         * Returns a shallow copy of this {@code TreeBoundedQueue}. The elements<a name="line.303"></a>
<span class="sourceLineNo">304</span>         * themselves are not cloned.<a name="line.304"></a>
<span class="sourceLineNo">305</span>         * <a name="line.305"></a>
<span class="sourceLineNo">306</span>         * @return a shallow copy of this queue<a name="line.306"></a>
<span class="sourceLineNo">307</span>         */<a name="line.307"></a>
<span class="sourceLineNo">308</span>        @SuppressWarnings("unchecked")<a name="line.308"></a>
<span class="sourceLineNo">309</span>        @Override<a name="line.309"></a>
<span class="sourceLineNo">310</span>        public TreeBoundedQueue&lt;E&gt; clone() throws CloneNotSupportedException {<a name="line.310"></a>
<span class="sourceLineNo">311</span>                TreeBoundedQueue&lt;E&gt; clone = (TreeBoundedQueue&lt;E&gt;) super.clone();<a name="line.311"></a>
<span class="sourceLineNo">312</span>                clone.delegate = (TreeQueue&lt;E&gt;) delegate.clone();<a name="line.312"></a>
<span class="sourceLineNo">313</span>                return clone;<a name="line.313"></a>
<span class="sourceLineNo">314</span>        }<a name="line.314"></a>
<span class="sourceLineNo">315</span><a name="line.315"></a>
<span class="sourceLineNo">316</span>}<a name="line.316"></a>




























































</pre>
</div>
</body>
</html>
